On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
نویسندگان
چکیده
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readiness equivalence and no finer than possible worlds equivalence does not have a finite basis. This semantic range includes ready trace equivalence.
منابع مشابه
On finite alphabets and infinite bases
Van Glabbeek (1990) presented the linear time – branching time spectrum of behavioral semantics. He studied these semantics in the setting of the basic process algebra BCCSP, and gave finite, sound and ground-complete, axiomatizations for most of these semantics. Groote (1990) proved for some of van Glabbeek’s axiomatizations that they are ω-complete, meaning that an equation can be derived if ...
متن کاملOn Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alphabet of actions, the equational theory of BCCSP modulo ready simulation equivalence does not have a finite basis. In contrast, with an infinite alphabet, the latter equational theory does have a finite basis.
متن کاملOn Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a finite basis. In contrast, in the presence of an alphabet that is infinite or a singleton, the equational theo...
متن کاملLarge alphabets : finite , infinite , and scaling models ( Invited Paper )
How can we effectively model situations with large alphabets? On a pragmatic level, any engineered system, be it for inference, communication, or encryption, requires working with a finite number of symbols. Therefore, the most straightforward model is a finite alphabet. However, to emphasize the disproportionate size of the alphabet, one may want to compare its finite size with the length of d...
متن کاملOn a Class of P Automata as a Machine Model for Languages over Infinite Alphabets
We show how P automata having a finite description and working with a finite object-alphabet can be used to describe languages over countably infinite alphabets. We propose to relate the language classes characterized by different types of P automata to some of the existing characterizations of language classes over infinite alphabets, and give an upper bound for the class of languages accepted...
متن کامل